Self-concordance is NP-hard
نویسنده
چکیده
We show that deciding whether a convex function is self-concordant is in general an intractable problem.
منابع مشابه
Nurse practitioner provision of patient education related to medicine
Objective To describe the perceptions of Australian NPs and NP candidates (student NP and NPs in transitional roles but not yet authorised) in regards to their confidence and practice in providing medicine information to patients / clients. Design An electronic survey related to prescribing practices. Setting The survey was open to all Australian NPs (n=250 at time of survey) and NP candidates....
متن کاملApproximable Sets Universitt at Karlsruhe
Much structural work on NP-complete sets has exploited SAT's d-self-reduci-bility. In this paper we exploit the additional fact that SAT is a d-cylinder to show that NP-complete sets are p-superterse unless P = NP. In fact, every set that is NP-hard under polynomial-time n o(1)-tt reductions is p-superterse unless P = NP. In particular no p-selective set is NP-hard under polynomial-time n o(1)-...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملThe Fault Tolerance of NP-Hard Problems
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are still hard for NP. We explain that our results are related to a weakened deterministic variant of the notion of program self-correction by Blum, Luby, and Rubinfeld. Among other results, we use the Left-Set technique ...
متن کاملA Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs
We show that computing the lexicographically first four-coloring for planar graphs is ∆p 2 hard. This result optimally improves upon a result of Khuller and Vazirani who prove this problem to be NP-hard, and conclude that it is not self-reducible in the sense of Schnorr, assuming P 6= NP. We discuss this application to non-self-reducibility and provide a general related result.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 68 شماره
صفحات -
تاریخ انتشار 2017